Nuprl Lemma : master-antecedent_wf 11,40

es:ES, Cmd:Type, Master:AbsInterface(chain_master()), Config:AbsInterface(chain_config()),
Sys:AbsInterface(chain_sys(Cmd)), m:({e:E(Master)| cmseq?(Master(e))} E(Config)).
master-antecedent{i:l}(es;Cmd;Master;Config;Sys;m  
latex


Definitionss = t, t  T, x:AB(x), x:AB(x), ES, a:A fp B(a), x:A  B(x), Type, EqDecider(T), Unit, left + right, IdLnk, Id, EOrderAxioms(Epred?info), f(a), EState(T), Knd, xt(x), x,yt(x;y), kindcase(ka.f(a); l,t.g(l;t) ), Msg(M), type List, , , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r  s, P  Q, , b, constant_function(f;A;B), P & Q, Top, strong-subtype(A;B), AbsInterface(A), E(X), chain_config(), X(e), cmseq-to(x), ccpred-id(x), loc(e), kind(e), cmseq-from(x), loc(e), let x,y = A in B(x;y), (e < e'), E, <ab>, {x:AB(x)} , case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , chain_master(), chain_sys(Cmd), cmseq?(x), (e <loc e'), ccpred?(x), t.1, P  Q, P  Q, f  g, f(x)?z, vartype(i;x), state@i, State(ds), State(ds), e  X, , SWellFounded(R(x;y)), pred!(e;e'), Void, x:A.B(x), S  T, suptype(ST), first(e), A, pred(e), x.A(x), tt, inr x , "$token", ff, inl x , Atom, False, True, cmseq-num(x), , cmd-history(e), ||as||, |g|, Atom$n, A c B, let x = a in b(x), master-antecedent{i:l}(es;Cmd;Master;Config;Sys;m)
Lemmases-locl wf, es-causl wf, ccpred? wf, es-interface-val wf, let wf, ccpred-id wf, cmseq-to wf, es-loc wf, cmseq-from wf, length wf1, cmd-history wf, cmseq-num wf, true wf, false wf, es-interface wf, bfalse wf, btrue wf, chain sys wf, kind wf, loc wf, not wf, first wf, pred! wf, strongwellfounded wf, cmseq? wf, es-interface-val wf2, chain master wf, chain config wf, es-is-interface wf, es-E wf, es-E-interface wf, member wf, top wf, constant function wf, assert wf, bool wf, qle wf, cless wf, val-axiom wf, rationals wf, nat wf, Msg wf, kindcase wf, Knd wf, EState wf, EOrderAxioms wf, Id wf, IdLnk wf, unit wf, deq wf, event system wf, subtype rel wf

origin